106 research outputs found
Caractérisation des performances minimales d'estimation pour des modèles d'observations non-standards
In the parametric estimation context, estimators performances can be characterized, inter alia, by the mean square error and the resolution limit. The first quantities the accuracy of estimated values and the second defines the ability of the estimator to allow a correct resolvability. This thesis deals first with the prediction the "optimal" MSE by using lower bounds in the hybrid estimation context (i.e. when the parameter vector contains both random and non-random parameters), second with the extension of Cramér-Rao bounds for non-standard estimation problems and finally to the characterization of estimators resolution. This manuscript is then divided into three parts :First, we fill some lacks of hybrid lower bound on the MSE by using two existing Bayesian lower bounds: the Weiss-Weinstein bound and a particular form of Ziv-Zakai family lower bounds. We show that these extended lower bounds are tighter than the existing hybrid lower bounds in order to predict the optimal MSE.Second, we extend Cramer-Rao lower bounds for uncommon estimation contexts. Precisely: (i) Where the non-random parameters are subject to equality constraints (linear or nonlinear). (ii) For discrete-time filtering problems when the evolution of states are defined by a Markov chain. (iii) When the observation model differs to the real data distribution.Finally, we study the resolution of the estimators when their probability distributions are known. This approach is an extension of the work of Oh and Kashyap and the work of Clark to multi-dimensional parameters estimation problems.Dans le contexte de l'estimation paramétrique, les performances d'un estimateur peuvent être caractérisées, entre autre, par son erreur quadratique moyenne (EQM) et sa résolution limite. La première quantifie la précision des valeurs estimées et la seconde définit la capacité de l'estimateur à séparer plusieurs paramètres. Cette thèse s'intéresse d'abord à la prédiction de l'EQM "optimale" à l'aide des bornes inférieures pour des problèmes d'estimation simultanée de paramètres aléatoires et non-aléatoires (estimation hybride), puis à l'extension des bornes de Cramér-Rao pour des modèles d'observation moins standards. Enfin, la caractérisation des estimateurs en termes de résolution limite est également étudiée. Ce manuscrit est donc divisé en trois parties :Premièrement, nous complétons les résultats de littérature sur les bornes hybrides en utilisant deux bornes bayésiennes : la borne de Weiss-Weinstein et une forme particulière de la famille de bornes de Ziv-Zakaï. Nous montrons que ces bornes "étendues" sont plus précises pour la prédiction de l'EQM optimale par rapport à celles existantes dans la littérature.Deuxièmement, nous proposons des bornes de type Cramér-Rao pour des contextes d'estimation moins usuels, c'est-à-dire : (i) Lorsque les paramètres non-aléatoires sont soumis à des contraintes d'égalité linéaires ou non-linéaires (estimation sous contraintes). (ii) Pour des problèmes de filtrage à temps discret où l'évolution des états (paramètres) est régit par une chaîne de Markov. (iii) Lorsque la loi des observations est différente de la distribution réelle des données.Enfin, nous étudions la résolution et la précision des estimateurs en proposant un critère basé directement sur la distribution des estimées. Cette approche est une extension des travaux de Oh et Kashyap et de Clark pour des problèmes d'estimation de paramètres multidimensionnels
Through the Wall Radar Imaging via Kronecker-structured Huber-type RPCA
The detection of multiple targets in an enclosed scene, from its outside, is
a challenging topic of research addressed by Through-the-Wall Radar Imaging
(TWRI). Traditionally, TWRI methods operate in two steps: first the removal of
wall clutter then followed by the recovery of targets positions. Recent
approaches manage in parallel the processing of the wall and targets via low
rank plus sparse matrix decomposition and obtain better performances. In this
paper, we reformulate this precisely via a RPCA-type problem, where the sparse
vector appears in a Kronecker product. We extend this approach by adding a
robust distance with flexible structure to handle heterogeneous noise and
outliers, which may appear in TWRI measurements. The resolution is achieved via
the Alternating Direction Method of Multipliers (ADMM) and variable splitting
to decouple the constraints. The removal of the front wall is achieved via a
closed-form proximal evaluation and the recovery of targets is possible via a
tailored Majorization-Minimization (MM) step. The analysis and validation of
our method is carried out using Finite-Difference Time-Domain (FDTD) simulated
data, which show the advantage of our method in detection performance over
complex scenarios
Hybrid Lower Bound On The MSE Based On The Barankin And Weiss-Weinstein Bounds
International audienceThis article investigates hybrid lower bounds in order to predict the estimators mean square error threshold effect. A tractable and computationally efficient form is derived. This form combines the Barankin and the Weiss-Weinstein bounds. This bound is applied to a frequency estimation problem for which a closed-form expression is provided. A comparison with results on the hybrid Barankin bound shows the superiority of this new bound to predict the mean square error threshold
High resolution techniques for Radar: Myth or Reality?
International audienceWe address the problem of effectiveness of the high resolution techniques applied to the conditional model. The rationale is based on a definition of the probability of resolution of maximum likelihood estimators which is computable in the asymptotic region of operation (in SNR and/or in large number of snapshots). The application case is the multiple tones estimation problem (Doppler frequencies estimation in radar)
Performance bounds for coupled models
Two models are called "coupled" when a non empty set of the underlying parameters are related through a differentiable implicit function. The goal is to estimate the parameters of both models by merging all datasets, that is, by processing them jointly. In this context, we show that the parameter estimation accuracy under a general class of dataset distributions always improves when compared to an equivalent uncoupled model. We eventually illustrate our results with the fusion of multiple tensor data
Riemannian optimization for non-centered mixture of scaled Gaussian distributions
This paper studies the statistical model of the non-centered mixture of
scaled Gaussian distributions (NC-MSG). Using the Fisher-Rao information
geometry associated to this distribution, we derive a Riemannian gradient
descent algorithm. This algorithm is leveraged for two minimization problems.
The first one is the minimization of a regularized negative log- likelihood
(NLL). The latter makes the trade-off between a white Gaussian distribution and
the NC-MSG. Conditions on the regularization are given so that the existence of
a minimum to this problem is guaranteed without assumptions on the samples.
Then, the Kullback-Leibler (KL) divergence between two NC-MSG is derived. This
divergence enables us to define a minimization problem to compute centers of
mass of several NC-MSGs. The proposed Riemannian gradient descent algorithm is
leveraged to solve this second minimization problem. Numerical experiments show
the good performance and the speed of the Riemannian gradient descent on the
two problems. Finally, a Nearest centroid classifier is implemented leveraging
the KL divergence and its associated center of mass. Applied on the large scale
dataset Breizhcrops, this classifier shows good accuracies as well as
robustness to rigid transformations of the test set
Robust Geometric Metric Learning
This paper proposes new algorithms for the metric learning problem. We start
by noticing that several classical metric learning formulations from the
literature can be viewed as modified covariance matrix estimation problems.
Leveraging this point of view, a general approach, called Robust Geometric
Metric Learning (RGML), is then studied. This method aims at simultaneously
estimating the covariance matrix of each class while shrinking them towards
their (unknown) barycenter. We focus on two specific costs functions: one
associated with the Gaussian likelihood (RGML Gaussian), and one with Tyler's M
-estimator (RGML Tyler). In both, the barycenter is defined with the Riemannian
distance, which enjoys nice properties of geodesic convexity and affine
invariance. The optimization is performed using the Riemannian geometry of
symmetric positive definite matrices and its submanifold of unit determinant.
Finally, the performance of RGML is asserted on real datasets. Strong
performance is exhibited while being robust to mislabeled data.Comment: Published in EUSIPCO 2022. Best student paper awar
Theory and Implementation of Complex-Valued Neural Networks
This work explains in detail the theory behind Complex-Valued Neural Network
(CVNN), including Wirtinger calculus, complex backpropagation, and basic
modules such as complex layers, complex activation functions, or complex weight
initialization. We also show the impact of not adapting the weight
initialization correctly to the complex domain. This work presents a strong
focus on the implementation of such modules on Python using cvnn toolbox. We
also perform simulations on real-valued data, casting to the complex domain by
means of the Hilbert Transform, and verifying the potential interest of CVNN
even for non-complex data.Comment: 42 pages, 18 figure
A Constrained Hybrid Cramér-Rao Bound for Parameter Estimation
In statistical signal processing, hybrid parameter estimation refers to the case where the parameters vector to estimate contains both non-random and random parameters. Numerous works have shown the versatility of deterministic constrained Cramér-Rao bound for estimation performance analysis and design of a system of measurement. However in many systems both random and non-random parameters may occur simultaneously. In this communication, we propose a constrained hybrid lower bound which take into account of equality constraint on deterministic parameters. The usefulness of the proposed bound is illustrated with an application to radar Doppler estimation
Borné de Cramér-Rao sous contraintes pour l’estimation simultanée de paramètres aléatoires et non aléatoires
In statistical signal processing, hybrid parameter estimation refers to the case where the parameters vector to estimate contains both
non-random and random parameters. On the other hand, numerous works have shown the versatility of deterministic constrained Cramér-Rao
bound for estimation performance analysis and design of a system of measurement. In this communication, we propose a constrained hybrid
lower bound which takes into account equality constraints on deterministic parameters. The proposed bound is then compared to previous bounds
of the literature. Finally, the usefulness of the proposed bound is illustrated with an application to radar Doppler estimation
- …